Search results for "Games in verification"

showing 1 items of 1 documents

Modular Strategies for Recursive Game Graphs

2006

AbstractMany problems in formal verification and program analysis can be formalized as computing winning strategies for two-player games on graphs. In this paper, we focus on solving games in recursive game graphs which can model the control flow in sequential programs with recursive procedure calls. While such games can be viewed as the pushdown games studied in the literature, the natural notion of winning in our framework requires the strategies to be modular with only local memory; that is, resolution of choices within a module does not depend on the context in which the module is invoked, but only on the history within the current invocation of the module. While reachability in (global…

Computer Science::Computer Science and Game TheoryTheoretical computer scienceGeneral Computer ScienceCombinatorial game theoryContext (language use)02 engineering and technology0102 computer and information sciences01 natural sciencesTheoretical Computer ScienceProgram analysisReachability0202 electrical engineering electronic engineering information engineering0101 mathematicsMathematicsbusiness.industry010102 general mathematics020207 software engineeringPushdown systemsResolution (logic)Modular designCall graphUndecidable problemModel-checkingGames in verification010201 computation theory & mathematicsbusinessComputer Science(all)
researchProduct